Reducing the Adjacency Matrix of a Tree
نویسندگان
چکیده
Let T be a tree, A its adjacency matrix, and a scalar. We describe a linear-time algorithm for reducing the matrix In +A. Applications include computing the rank of A, nding a maximum matching in T , computing the rank and determinant of the associated neighborhood matrix, and computing the characteristic polynomial of A.
منابع مشابه
THE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملAn Approach of Graph Isomorphism Detection based on Vertex-Invariant
Graph Isomorphism is a widely studied problem due to its practical applications in various fields of networks, chemistry and finger print detection, recent problems in biology such as diabetes detection, protein structure and information retrieval. An approach to the graph isomorphism detection is based on vertex invariant. In the existing approach vertex invariants is used to partition the mat...
متن کاملThe machine learning process in applying spatial relations of residential plans based on samples and adjacency matrix
The current world is moving towards the development of hardware or software presence of artificial intelligence in all fields of human work, and architecture is no exception. Now this research seeks to present a theoretical and practical model of intuitive design intelligence that shows the problem of learning layout and spatial relationships to artificial intelligence algorithms; Therefore, th...
متن کاملHow to Construct the Characteristic Polynomial of a Tree's Adjacency Matrix
We describe a simple, O(n 2 log(n)) algorithm to nd the characteristic polynomial of the adjacency matrix of any tree. An example is given showing the algorithm applied to a 13-vertex tree.
متن کاملQuantitative Correlation of Randić Indices and Adjacency Matrixes With Dewar Resonance Energy of Annulene Compounds
Topological indices are the numerical value associated with chemical constitution purporting for correlation ofchemical structure with various physical properties, chemical reactivity or biological activity. Graph theory is adelightful playground for the exploration of proof techniques in Discrete Mathematics and its results haveapplications in many areas of sciences. One of the useful indices ...
متن کامل